Partially-commutative context-free processes: Expressibility and tractability
نویسندگان
چکیده
منابع مشابه
Partially-Commutative Context-Free Processes
Bisimulation equivalence is decidable in polynomial time for both sequential and commutative normed context-free processes, known as BPA and BPP, respectively. Despite apparent similarity between the two classes, different techniques were used in each case. We provide one polynomial-time algorithm that works in a superclass of both normed BPA and BPP. It is derived in the setting of partially-c...
متن کاملPartially-commutative context-free graphs
This thesis is about an extension of context-free grammars with partial commutation on nonterminal symbols. In particular, we investigate the subclass with transitive dependence relation and the corresponding automaton model: stateless multi-pushdown automata. The results of the thesis are divided into three chapters. The first chapter investigates language expressivity of concerned classes. Ro...
متن کاملPartially-commutative context-free languages
The paper is about a class of languages that extends context-free languages (CFL) and is stable under shuffle. Specifically, we investigate the class of partially-commutative context-free languages (pc CFL), where non-terminal symbols are commutative according to a binary independence relation, very much like in trace theory. The class has been recently proposed as a robust class subsuming CFL ...
متن کاملOn Commutative Context-Free Languages
Let C = {a,, a2, . . . . a,} be an alphabet and let LcZ* be the commutative image of FP* where F and P are finite subsets of Z*. If, for any permutation c of { 1,2, . . . . n}, L n a&) a%, is context-free, then L is context-free. This theorem provides a solution to the Fliess conjecture in a restricted case. If the result could be extended to finite unions of the FP* above, the Fliess conjectur...
متن کاملTransitive factorizations of free partially commutative monoids and Lie algebras
Let M(A, θ) be a free partially commutative monoid. We give here a necessary and sufficient condition on a subalphabet B ⊂ A such that the right factor of a bisection M(A, θ) = M(B, θB).T be also partially commutative free. This extends strictly the (classical) elimination theory on partial commutations and allows to construct new factorizations of M(A, θ) and associated bases of LK(A, θ).
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 2011
ISSN: 0890-5401
DOI: 10.1016/j.ic.2010.12.003